Hook removal operators on the odd Young graph
نویسندگان
چکیده
منابع مشابه
On the asymptotic behavior of odd operators
We give quantitative versions of strong convergence results due to Baillon, Bruck and Reich for iterations of nonexpansive odd (and more general) operators in uniformly convex Banach spaces.
متن کاملOn Coloring the Odd-Distance Graph
We present a proof, using spectral techniques, that there is no finite measurable coloring of the odd-distance graph.
متن کاملThe Odd-Distance Plane Graph
The vertices of the odd-distance graph are the points of the plane R. Two points are connected by an edge if their Euclidean distance is an odd integer. We prove that the chromatic number of this graph is at least five. We also prove that the odd-distance graph in R is countably choosable, while such a graph in R is not.
متن کاملDifferential Operators, Shifted Parts, and Hook Lengths
We discuss Sekiguchi-type differential operators, their eigenvalues, and a generalization of Andrews-Goulden-Jackson formula. These will be applied to extract explicit formulae involving shifted partitions and hook lengths. 1. Differential operators. The standard Jack symmetric polynomials Pλ(y1, . . . , yn;α) (see Macdoland, Stanley [5, 10]) as well as their shifted counter-parts (replace θ = ...
متن کاملthe impact of musical texts on the text recall of young learners of english in isfahan junior high schools
abstract although music possesses some kind of power and using it has been welcome by many students in language classrooms, it seems that they take a non-serious image of the lesson while listening to songs and they may think that it is a matter of fun. the main objective of the present study was to investigate whether learning a foreign language through musical texts (songs) can have an impac...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algebraic Combinatorics
سال: 2019
ISSN: 2589-5486
DOI: 10.5802/alco.42